Description: 给定一块宽度为W的矩形板，矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi，宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。要求求出一种切割法使得所使用的矩形板的高度h最小．用递归及分治法解此问题-given a width of the rectangular plate W, the height of rectangular plate unrestricted. Board is required from the respective cut out n height of the hi, wi width of the rectangular parts. Cutting parts to the rules of the height of the rectangular plate with a high degree of consistent direction. Asked obtained a law made by cutting the use of the rectangular plate height h minimum. Using recursive and partition Solving this problem Platform: |
Size: 1373 |
Author:叶黎 |
Hits:
Description: 给定一块宽度为W的矩形板，矩形板的高度不受限制。现需要从板上分别切割出n个高度为hi，宽度为wi的矩形零件。切割的规则是零件的高度方向与矩形板的高度方向保持一致。要求求出一种切割法使得所使用的矩形板的高度h最小．用递归及分治法解此问题-given a width of the rectangular plate W, the height of rectangular plate unrestricted. Board is required from the respective cut out n height of the hi, wi width of the rectangular parts. Cutting parts to the rules of the height of the rectangular plate with a high degree of consistent direction. Asked obtained a law made by cutting the use of the rectangular plate height h minimum. Using recursive and partition Solving this problem Platform: |
Size: 1024 |
Author:叶黎 |
Hits:
Description: 算法设计与分析中贪心算法C++实现代码 包括但愿最短路径问题，哈弗曼编码，整数最有分解，最小生成树，最优分解，删数问题等-Algorithm Design and Analysis of greedy algorithm in C++ code, including the realization of hope that the shortest path problem,哈弗曼coding, the most integral decomposition, minimum spanning tree, optimal decomposition, cut the number of issues Platform: |
Size: 9216 |
Author:liudan |
Hits:
Description: cut 最小割问题 网络G=(V,E)的割cut(S,T)是将G的顶点集V划分为2个不相交的子集S和T，使s Î S ，
t Î T ，且cut(S,T) = {(u,v)Î E | u Î S,vÎ T}。设每条边(u,v)的边权为a(u,v),则割
cut(S,T)的权值为cut(S,T)中所有边权之和。最小割问题要求网络G 的权值最小的割。-cut the minimum cut problem network G = (V, E) of the cut cut (S, T) is the vertex set V of G into two disjoint subsets S and T, so that s Î S, t Î T, and cut ( S, T) = {(u, v) Î E | u Î S, vÎ T}. Let each edge (u, v) the right side is a (u, v), then cut cut (S, T) has a weight cut (S, T) and the rights of all sides. Minimum cut problem requires a network G, the minimum weight cut. Platform: |
Size: 336896 |
Author:yjian |
Hits:
Description: 对matlab解决图论问题的算法做个汇总。主要包括：顶点覆盖近似算法、哈密尔顿回路、最大流和最小截、最短路和次短路、最小生成树Prim算法、最短路径等等。由于太多就不一一列举了。-Matlab to solve the problem of graph theory algorithms to be aggregated. Include: vertex cover approximation algorithm, Hamilton circuit, the maximum flow and minimum cut shortest times short circuit, Prim minimum spanning tree algorithm, the shortest path. Not because of too many to enumerate. Platform: |
Size: 55296 |
Author:中士 |
Hits:
Description: 使用能量最小法中的图割法，解决图像分类问题，最大流=最小割(The minimum method of energy in the map cut method to solve the problem of image classification) Platform: |
Size: 28672 |
Author:111111111111
|
Hits:
Description: 利用能量最小法中的图割法，解决图像分类问题，最大流=最小割(The minimum method of energy in the map cut method to solve the problem of image classification) Platform: |
Size: 26624 |
Author:111111111111
|
Hits:
Search - minimum cut problem